Non-Unique factorizations of algebraic integers
نویسندگان
چکیده
منابع مشابه
Factorizations of Algebraic Integers, Block Monoids, and Additive Number Theory
Let D be the ring of integers in a finite extension of the rationals. The classic examination of the factorization properties of algebraic integers usually begins with the study of norms. In this paper, we show using the ideal class group, C(D), of D that a deeper examination of such properties is possible. Using the class group, we construct an object known as a block monoid, which allows us t...
متن کاملLocalized Factorizations of Integers
We determine the order of magnitude of H(k+1)(x,y, 2y), the number of integers n ≤ x that are divisible by a product d1 · · · dk with yi < di ≤ 2yi, when the numbers log y1, . . . , log yk have the same order of magnitude and k ≥ 2. This generalizes a result by Kevin Ford when k = 1. As a corollary of these bounds, we determine the number of elements up to multiplicative constants that appear i...
متن کاملOrdered and Unordered Factorizations of Integers
We study the number of ways of writing a positive integer n as a product of integer factors greater than one. We survey methods from the literature for enumerating and also generating lists of such factorizations for a given number n. In addition, we consider the same questions with respect to factorizations that satisfy constraints, such as having all factors distinct. We implement all these m...
متن کاملAlgebraic Numbers and Algebraic Integers
c © W W L Chen, 1984, 2013. This chapter originates from material used by the author at Imperial College London between 1981 and 1990. It is available free to all individuals, on the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied, with or without permission from the author. However, this document may not be kept on any information storage an...
متن کاملUnique Games Over Integers
Consider systems of two-variable linear equations of the form xi−xj = cij , where the cij ’s are integer constants. We show that even if there is an integer solution satisfying at least a (1− )fraction of the equations, it is Unique-Games-hard to find an integer (or even real) solution satisfying at least an -fraction of the equations. Indeed, we show it is Unique-Games-hard even to find an -go...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Functiones et Approximatio Commentarii Mathematici
سال: 2008
ISSN: 0208-6573
DOI: 10.7169/facm/1229696553